#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define ii pair<ll,ll>
#define iid pair<ld,ld>
#define sl pair<string,ll>
#define MP make_pair
#define F first
#define S second
#define mod1 998244353
#define mod 1000000007
void solve()
{
ll n;
cin>>n;
string s;
cin>>s;
ll cnt=0;
ll temp=0;
ll i=0;
while(i<n)
{
temp=1;
while(i<n && s[i]=='<')
{
temp++;
i++;
}
if(cnt<temp)
{
cnt=temp;
}
temp=1;
while(i<n && s[i]=='>')
{
temp++;
i++;
}
if(cnt<temp)
{
cnt=temp;
}
}
cout<<cnt<<endl;
return;
}
int main()
{
ll t;
t=1;
cin>>t;
while(t--)
{
solve();
}
}
1716C - Robot in a Hallway | 1688B - Patchouli's Magical Talisman |
99A - Help Far Away Kingdom | 622B - The Time |
1688C - Manipulating History | 1169D - Good Triple |
1675B - Make It Increasing | 588A - Duff and Meat |
1541B - Pleasant Pairs | 1626B - Minor Reduction |
1680A - Minimums and Maximums | 1713A - Traveling Salesman Problem |
1713B - Optimal Reduction | 1710A - Color the Picture |
1686B - Odd Subarrays | 251A - Points on Line |
427C - Checkposts | 1159A - A pile of stones |
508A - Pasha and Pixels | 912A - Tricky Alchemy |
1249A - Yet Another Dividing into Teams | 1713C - Build Permutation |
1699A - The Third Three Number Problem | 1617B - GCD Problem |
841A - Generous Kefa | 1690B - Array Decrements |
1692C - Where's the Bishop | 104A - Blackjack |
1438A - Specific Tastes of Andre | 1711C - Color the Picture |